Delay Distribution of (Im)Patient Customers in a Discrete Time D-MAP/PH/1 Queue with Age-Dependent Service Times

نویسندگان

  • Benny Van Houdt
  • R. B. Lenin
  • Chris Blondia
چکیده

This paper presents an algorithmic procedure to calculate the delay distribution of (im)patient customers in a discrete time D-MAP/PH/1 queue, where the service time distribution of a customer depends on his waiting time. We consider three different situations: impatient customers in the waiting room, impatient customers in the system, that is, if a customer has been in the waiting room, respectively, in the system for a time units it leaves the waiting room, respectively, the system. In the third situation, all customers are patient—that is, they only leave the system after completing service. In all three situations the service time of a customer depends upon the time he has spent in the waiting room. As opposed to the general approach in many queueing systems, we calculate the delay distribution, using matrix analytic methods, without obtaining the steady state probabilities of the queue length. The trick used in this paper, which was also applied by Van Houdt and Blondia [J. Appl. Probab. Vol. 39, No 1, pp. 213–222 (2002)], is to keep track of the “age” of the customer in service, while remembering the DMAP state immediately after the customer in service arrived. Possible extentions of this method to more general queues and numerical examples that demonstrate the strength of the algorithm are also included.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unreliable Server Mx/G/1 Queue with Loss-delay, Balking and Second Optional Service

This investigation deals with MX/G/1 queueing model with setup, bulk- arrival, loss-delay and balking. The provision of second optional service apart from essential service by an unreliable server is taken into consideration. We assume that the delay customers join the queue when server is busy whereas loss customers depart from the system. After receiving the essential service, the customers m...

متن کامل

Response Time Distribution in a D-map/ph/1 Queue with General Customer Impatience

This paper presents two methods to calculate the response time distribution of impatient customers in a discrete-time queue with Markovian arrivals and phase-type services, in which the customers’ patience is generally distributed (i.e., the D-MAP/PH/1 queue). The first approach uses a GI/M/1 type Markov chain and may be regarded as a generalization of the procedure presented in Van Houdt [14] ...

متن کامل

Queues with correlated service and inter-arrival times and its application to optical buffers

This paper presents an algorithmic procedure to calculate the queue length and delay distribution of customers in a discrete time D-MAP/PH/1 queue, where the service time distribution of a customer depends on the inter-arrival time between himself and his predecessor. Setting up a Markov chain that keeps track of the contents of such a queue will result in a state space explosion as the inter-a...

متن کامل

A Study on State Dependent Accessible and Second Optional Service Queue with Impatient and Feedback Customers

In this paper, we study a single server Markovian queue with state dependent accessible services, reneging and feedback of customers. The server can accommodate at the most $d$ customers in the service station, after which the new arrivals have to wait in the primary queue of infinite waiting space. All arrivals demand First Essential Service (FES), after completing FES, customers decide to joi...

متن کامل

DISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Queueing Syst.

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2003